A quantum circuit to generate random numbers within a specific interval

نویسندگان

چکیده

Abstract Random numbers are of vital importance in fields such as cyptography and scientific simulations. However, it is well known how difficult for classical computers to generate random numbers. This not the case quantum computers, which able genuinely thanks property superposition their counter-intuitive concept measurement. despite simplicity designing a circuit that generates number between 0 $2^{N}-1$ 2 N − 1 (being N available qubits), within specific interval far from trivial. paper proposes customizable design The non- hardware dependent, allows fault-tolerance, can be used by current devices. Therefore, valuable tool all those applications algorithms need work with Moreover, comparator has also been designed part this work. best currently literature terms qubits, T-count, T-depth. It therefore useful any other or algorithm where operation needed.

منابع مشابه

Can brains generate random numbers?

Motivated by EEG recordings of normal brain activity, we construct arbitrarily large McCulloch-Pitts neural networks that, without any external input, make every subset of their neurons fire in some iteration (and therefore in infinitely many iterations).

متن کامل

Using graphics processing units to generate random numbers

The future of high-performance computing is aligning itself towards the efficient use of highly parallel computing environments. One application where the use of massive parallelism comes instinctively is Monte Carlo simulations, where a large number of independent events have to be simulated. At the core of the Monte Carlo simulation lies the Random Number Generator (RNG). In this paper, the m...

متن کامل

Few Points to Generate a Random Polytope

A random polytope, Kn, is the convex hull of n points chosen randomly, independently, and uniformly from a convex body K^R. It is shown here that, with high probability, Kn can be obtained by taking the convex hull of m = o(n) points chosen independently and uniformly from a small neighbourhood of the boundary of K. §

متن کامل

How to generate random numbers with a power ( or any other ) density ∗

We derive the “inversion algorithm” to generate random numbers in a specified interval x1 ≤ x ≤ x2 with 100% efficiency for a one-dimensional distribution with a power density, based on the uniform random number generator in [0, 1]. We then review the method applicable to the case of the most general one-dimensional density, and apply it to obtain the algorithms for several other distributions ...

متن کامل

Evolving a Computer Program to Generate Random Numbers Using the Genetic Programming Paradigm

This paper demonstrates that it is possible to genetically breed a computer program that is considered difficult to write, namely, a randomizer that converts a sequence of consecutive integers into pseudo-random bits with near maximal entropy. 1 . INTRODUCTION AND OVERVIEW "How can computers learn to solve problems without being explicitly programmed?" This question, which is a central question...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: EPJ Quantum Technology

سال: 2023

ISSN: ['2196-0763', '2662-4400']

DOI: https://doi.org/10.1140/epjqt/s40507-023-00174-1